Scalable Mitigation of Measurement Errors on Quantum Computers

نویسندگان

چکیده

We present a method for mitigating measurement errors on quantum computing platforms that does not form the full assignment matrix, or its inverse, and works in subspace defined by noisy input bit strings. This accommodates both uncorrelated correlated allows computation of accurate error bounds. Additionally, we detail matrix-free preconditioned iterative-solution converges O(1) steps is performant uses orders magnitude less memory than direct factorization. demonstrate validity our mitigate few seconds numbers qubits would otherwise be impractical.1 MoreReceived 6 September 2021Accepted 8 October 2021DOI:https://doi.org/10.1103/PRXQuantum.2.040326Published American Physical Society under terms Creative Commons Attribution 4.0 International license. Further distribution this work must maintain attribution to author(s) published article's title, journal citation, DOI.Published SocietyPhysics Subject Headings (PhySH)Research AreasQuantum computationTechniquesNumerical techniquesQuantum Information

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Scalable Linear-Optical Quantum Computers

Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite the ease of implementation of one-qubit gates. Two-qubit gates necessarily need a non-linear interaction between the two photons, and the efficiency of this non-linear interaction is typically very small in bulk materials. However, it has recently been show...

متن کامل

Algorithmic cooling and scalable NMR quantum computers.

We present here algorithmic cooling (via polarization heat bath)-a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by using a set of rapidly thermal-relaxing bits. Such auxiliary b...

متن کامل

A Theory Of Errors in Quantum Measurement

It is common to model the random errors in a classical measurement by the normal (Gaussian) distribution, because of the central limit theorem. In the quantum theory, the analogous hypothesis is that the matrix elements of the errors of an observable are distributed normally. We obtain the probability distribution this implies for the outcome of a measurement, exactly for the case of traceless ...

متن کامل

Manifold algorithmic errors in quantum computers with static internal imperfections

The inevitable existence of static internal imperfections and residual interactions in some quantum computer architectures result in internal decoherence, dissipation, and destructive unitary shifts of active algorithms. By exact numerical simulations we determine the relative importance and origin of these errors for a Josephson charge qubit quantum computer. In particular we determine that th...

متن کامل

Quantum Gravity on Computers

Some times Thomas Hardy has been compared to Dostoevski, but Dostoevski is an incomparably ner artist. If Dostoevski's works could be compared to some of say, Rubens' paintings, then Hardy's are neatly nished diagrams drawn on graph paper with ruler and compass! Compare for instance the tragedy to Tess with that of Sonia, or the culmination of the forces in Raskolnikoo's confession with the mel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PRX quantum

سال: 2021

ISSN: ['2691-3399']

DOI: https://doi.org/10.1103/prxquantum.2.040326